Steady-state analysis of a multiclass MAP/PH/c queue with acyclic PH retrials

نویسندگان

  • Tugrul Dayar
  • M. Can Orhan
چکیده

A multi-class c-server retrial queueing system in which customers arrive according to a class-dependent Markovian arrival process (MAP) is considered. Service and retrial times follow class-dependent phase-type (PH) distributions with the further assumption that PH distributions of retrial times are acyclic. A necessary and sufficient condition for ergodicity is obtained from criteria based on drifts. The infinite state space of the model is truncated with an appropriately chosen Lyapunov function. The truncated model is described as a multi-dimensional Markov chain and a Kronecker representation of its generator matrix is numerically analyzed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete-Time Analysis of MAP/PH/1 Multiclass General Preemptive Priority Queue

We use the matrix-geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady-state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981),...

متن کامل

The workload-dependent MAP/PH/1 queue with infinite/finite workload capacity

We propose a numerical algorithm for finding the steady-state queue occupancy distribution for a workload-dependent MAP/PH/1 queue in which the arrival process and the service rate depend continuously on the instantaneous workload in the system. Both infinite and finite queue capacity scenarios are considered, including partial rejection and complete rejection policies for the latter. Using dis...

متن کامل

Analysis of MAP/PH(1), PH(2)/2 Queue with Bernoulli Vacations

We consider a two-heterogeneous-server queueing system with Bernoulli vacation in which customers arrive according to a Markovian arrival process MAP . Servers returning from vacation immediately take another vacation if no customer is waiting. Using matrix-geometric method, the steady-state probability of the number of customers in the system is investigated. Some important performance measure...

متن کامل

Sensitivity and Approximation of M/G/c Queue: Numerical Experiments∗

The sensitivity of the performance measures such as the mean and the standard deviation of the queue length and the blocking probability with respect to the moments of the service time are numerically investigated. The steady state distribution of M/G/c queue is approximated by that of the M/PH/c queue where the phase type (PH) distribution is fitted by matching the first three moments of the s...

متن کامل

Asymptotics for Steady-state Tail Probabilities in Structured Markov Queueing Models

In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Probability

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2016